N-Person Bargaining and Strategic Complexity¤
نویسنده
چکیده
We investigate the e®ect of introducing costs of complexity in the n -person unanimity bargaining game. In particular, the paper provides a justi ̄cation for stationary equilibrium strategies in the class of games where complexity costs matter. As is well-known, in this game every individually rational allocation is sustainable as a Nash equilibrium (also as a subgame perfect equilibrium if players are su±ciently patient and if n > 2). Moreover, delays in agreement are also possible in such equilibria. By limiting ourselves to strategies that can be implemented by a machine (automaton) and by suitably modifying the de ̄nition of complexity for the purpose of analysing a single extensive form, we ̄nd that complexity costs do not reduce the range of possible allocations but they do limit the amount of delay that can occur in any agreement. In particular, we show that in any n-player game, for any allocation z; an agreement on z at any period t can be sustained as a Nash equilibrium of the machine game with complexity costs if and only if t · n: We use the limit on delay result to establish that, in equilibrium, the machines implement stationary strategies. ¤The ̄rst version of this paper was written in 1994. Chatterjee wishes to acknowledge the hospitality of St.John's College, Cambridge during the initial period of work on this paper. Another substantial revision was done when Chatterjee was a guest at CRIEFF, University of St. Andrews, and we are grateful also for the stimulating environment there. We also thank Luca Anderlini, Ani Dasgupta, Vijay Krishna and Ariel Rubinstein for comments on earlier versions. A shorter paper with a related but di®erent de ̄nition of complexity, "Multiperson Bargaining and Strategic Complexity", is forthcoming in Econometrica. Three anonymous referees and a Co-Editor made comments that helped us greatly to refocus the contents of the two papers. yThe current, March 1999, version is based primarily on one written in April 1998, and presents our results in some detail.
منابع مشابه
Multiperson Bargaining and Strategic Complexity¤y
We investigate the e®ect of introducing costs of complexity in the n -person unanimity bargaining game. As is well-known, in this game every individually rational allocation is sustainable as a Nash equilibrium (also as a subgame perfect equilibrium if players are su±ciently patient and if n > 2). Moreover, delays in agreement are also possible in such equilibria. By limiting ourselves to a pla...
متن کاملThe representative Nash solution for two-sided bargaining problems
An n-person bargaining situation is two-sided when participants of bargaining are divided into two groups and their preferences over bargained outcomes are exactly opposite to each other. This is so when the issue on the bargaining table is represented by a one dimensional set and people’s preferences are monotonically increasing in one group and monotonically decreasing in the other group. In ...
متن کاملCooperation in Strategic Games Revisited∗
For two-person complete-information strategic games with transferable utility, all major variable-threat bargaining and arbitration solutions coincide. This confluence of solutions by luminaries such as Nash, Harsanyi, Raiffa, and Selten, is more than mere coincidence. Staying in the class of two-person games with transferable unility, the present paper presents a more complete theory that expa...
متن کاملVehicle Routing Problem in Competitive Environment: Two-Person Nonzero Sum Game Approach
Vehicle routing problem is one of the most important issues in transportation. Among VRP problems, the competitive VRP is more important because there is a tough competition between distributors and retailers. In this study we introduced new method for VRP in competitive environment. In these methods Two-Person Nonzero Sum games are defined to choose equilibrium solution. Therefore, revenue giv...
متن کاملThe Harsanyi Solution to the Bargaining Problem
In the present chapter we introduce several generalizations to the formulation and solution of the bargaining problem. Until the early 1960s, the study of social power (including political power) had been carried out exclusively by social scholars. That changed in 1962, when Harsanyi managed to introduce the rigor of mathematical reasoning into the theory of social power. He achieved this by ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999